Split–merge: Using exponential neighborhood search for scheduling a batching machine
نویسندگان
چکیده
منابع مشابه
Exponential neighborhood search for a parallel machine scheduling problem
We consider the parallel machine scheduling problem where jobs have different earlinesstardiness penalties and a restrictive common due date. This problem is NP-hard in the strong sense. In this paper we define an exponential size neighborhood for this problem and prove that finding the local minimum in it is an NP-hard problem. The main contribution of this paper is to propose a pseudo-polynom...
متن کاملAn Exponential Neighborhood for a One-Machine Batching Problem
In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.
متن کاملScheduling a Batching Machine
We address the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times. A batching machine is a machine that can handle up to b jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is equal to the la...
متن کاملVariable Neighborhood Search for Order Batching in a Warehouse
In this paper we address the problem of batching orders in a warehouse, with the objective of minimizing the total travel time. Order batching is an NP-hard optimization problem that is very difficult to solve exactly in practice. Thus, most implemented solutions are based on elementary heuristic methods that perform a relatively limited exploration of the solution space. As an alternative, we ...
متن کاملTwo-Machine Flowshop Batching and Scheduling
We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The forming of each batch on the second machine incurs a constant setup time. The objective is to minimize the makespan. This problem was previously shown to be NP-hard in the ordinary sense. In this paper, we first presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2015
ISSN: 0305-0548
DOI: 10.1016/j.cor.2015.04.017